Generating functions for Hurwitz–Hodge integrals
نویسندگان
چکیده
منابع مشابه
Generating Functions for Hurwitz-Hodge Integrals
In this paper we describe explicit generating functions for a large class of Hurwitz-Hodge integrals. These are integrals of tautological classes on moduli spaces of admissible covers, a (stackily) smooth compactification of the Hurwitz schemes. Admissible covers and their tautological classes are interesting mathematical objects on their own, but recently they have proved to be a useful tool f...
متن کاملConditional Moment Generating Functions for Integrals and Stochastic Integrals
In this paper we present two methods for computing filtered estimates for moments of integrals and stochastic integrals of continuous-time nonlinear systems. The first method utilizes recursive stochastic partial differential equations. The second method utilizes conditional moment generating functions. An application of these methods leads to the discovery of new classes of finitedimensional f...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملOn composition of generating functions
In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...
متن کاملGenerating functions for generating trees
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2008
ISSN: 0001-8708
DOI: 10.1016/j.aim.2008.03.012